Parallelization of Connectionist Models Based on a Symbolic Formalism
نویسندگان
چکیده
In this paper we study the parallelization of the inference process for connectionist models. We use a symbolic formalism for the representation of the connectionist models. With this translation, the training mechanism is local in the elements of the network, the computing power is improved in the network nodes and a local hybridization with symbolic parts is achieved. The inference in the nal knowledge network can be parallelized, whether the knowledge corresponds to a symbolic module, a connectionist model or a hybrid connectionist-symbolic module. Besides, the concurrency for knowledge networks corresponding to connectionist models is presented for the phases of processing and training. The parallelization is studied for a multiprocessor architecture with shared memory.
منابع مشابه
Parallelization of Rich Models for Steganalysis of Digital Images using a CUDA-based Approach
There are several different methods to make an efficient strategy for steganalysis of digital images. A very powerful method in this area is rich model consisting of a large number of diverse sub-models in both spatial and transform domain that should be utilized. However, the extraction of a various types of features from an image is so time consuming in some steps, especially for training pha...
متن کاملDynamical Insight into Structure 1 Running head: DYNAMICAL INSIGHT INTO STRUCTURE IN CONNECTIONIST MODELS Dynamical Insight into Structure in Connectionist Models
I discuss a connectionist model, based on Elman’s (1990, 1991) Simple Recurrent Network, of the acquisition of complex syntactic structure. While not intended as a detailed model of the process children go through in acquiring natural languages, the model helps clarify concepts that may be useful for understanding the development of complex abilities. It provides evidence that connectionist lea...
متن کاملA corpus-based connectionist architecture for large-scale natural language parsing
We describe a deterministic shift-reduce parsing model that combines the advantages of connectionism with those of traditional symbolic models for parsing realistic sub-domains of natural language. It is a modular system that learns to annotate natural language texts with syntactic structure. The parser acquires its linguistic knowledge directly from pre-parsed sentence examples extracted from ...
متن کاملSyntactic Category Formation with Vector Space Grammars
A method for deriving phrase structure categories from structured samples of a context-free language is presented. The learning algorithm is based on adaptation and competition, as well as error backpropagation in a continuous vector space. These connectionist-style techniques become applicable to grammars as the traditional grammar formalism is generalized to use vectors instead of symbols as ...
متن کاملHybrid preference machines based on inspiration from neuroscience
In the past, a variety of computational problems have been tackled with different connectionist network approaches. However, very little research has been done on a framework which connects neuroscience-inspired models with connectionist models and higher level symbolic processing. In this paper, we outline a preference machine framework which focuses on a hybrid integration of various neural a...
متن کامل